Every decidable pseudovariety of abelian groups is completely tame
نویسندگان
چکیده
منابع مشابه
Theory of Square-like Abelian Groups Is Decidable
A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory of square-like abelian groups is decidable. This answers a question posed by D. Spellman.
متن کاملCompletely Bounded Quantiication Is Decidable
This paper proves the decidability of subtyping for F when the bounds on polymorphic types do not contain Top (i.e., in all types of the form 8<: 1 :: 2 , 1 does not contain Top). This general restriction is subsequently relaxed to allow unbounded quantiication.
متن کاملSuperposition with completely built-in Abelian groups
A new technique is presented for superposition with first-order clauses with built-in Abelian groups (AG). Compared with previous approaches, it is simpler, and AG-unification is used instead of the computationally more expensive unification modulo associativity and commutativity. Furthermore, no inferences with the AG axioms or abstraction rules are needed; in this sense this is the first appr...
متن کاملEvery Abelian Group Is a Class Group
Let T be the set of minimal primes of a Krull domain A. If S is a subset of T9 we form B = n AP for PeS and study the relation of the class group of B to that of A. We find that the class group of B is always a homomorphic image of that of A. We use this type of construction to obtain a Krull domain with specified class group and then alter such a Krull domain to obtain a Dedekind domain with t...
متن کاملTameness of pseudovariety joins involving R 1
In this paper, we establish several decidability results for pseudovariety joins of the form V ∨ W, where V is a subpseudovariety of J or the pseudovariety R. Here, J (resp. R) denotes the pseudovariety of all J-trivial (resp. R-trivial) semigroups. In particular, we show that the pseudovariety V ∨ W is (completely) κ-tame when V is a subpseudovariety of J with decidable κ-word problem and W is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2019
ISSN: 0037-1912,1432-2137
DOI: 10.1007/s00233-019-10024-1